import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            //读取矩阵的行n和列m，以及查询次数q
            int n = in.nextInt();
            int m = in.nextInt();
            int q = in.nextInt();
            int[][] a = new int[n + 1][m + 1];
            //读取矩阵
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                    a[i][j] = in.nextInt();
                }
            }
            //创建前缀和矩阵
            long[][] dp = new long[n + 1][m + 1];
            for(int i = 1; i <= n; i++){
                for(int j = 1; j <= m; j++){
                    dp[i][j] = dp[i - 1][j] + dp[i][j - 1] + a[i][j] -dp[i - 1][j - 1];
                }
            }
            //查询
            while(q > 0){
                int x1 = in.nextInt();
                int y1 = in.nextInt();
                int x2 = in.nextInt();
                int y2 = in.nextInt();
                long sum = dp[x2][y2] - dp[x2][y1 - 1] - dp[x1 - 1][y2] + dp[x1 - 1][y1 - 1];
                System.out.println(sum);
                q--;
            }
        }
    }
    public static void main1(String[] args) {
        Scanner in = new Scanner(System.in);
        // 注意 hasNext 和 hasNextLine 的区别
        while (in.hasNextInt()) { // 注意 while 处理多个 case
            //n行m列， 查询q次
            int n = in.nextInt();
            int m = in.nextInt();
            int q = in.nextInt();
            //读矩阵
            int[][] a = new int[n + 1][m + 1];
            long[][] dp = new long[n + 1][m + 1];
            for(int i = 1; i <= n; i++){
                long sum = 0;
                for(int j = 1; j <= m; j++){
                    a[i][j] = in.nextInt();
                    sum += a[i][j];
                    dp[i][j] = sum;
                }
            }
            //进行q次查询
            while(q > 0){
                int row1 = in.nextInt();
                int col1 = in.nextInt();
                int row2 = in.nextInt();
                int col2 = in.nextInt();
                long sum = 0;
                for(int i = row1; i <= row2; i++){
                    sum += (dp[i][col2] - dp[i][col1 - 1]);
                }
                System.out.println(sum);
                q--;
            }
        }
    }
}